Iterative decreasing dimension algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterative Algorithm for the Mixed H2/h∞ Control Problem Using H2 Norm Decreasing Controller Sets

This paper is concerned with the mixed H2/H∞ control problem. The purpose of this paper is to give an iterative algorithm for finding a sub-optimal static state feedback controller for the mixed H2/H∞ control problem. The key idea of our algorithm is to construct two “controller sets”: one is a set of controllers that improve the H2 norm of the closed loop map for a given controller and the oth...

متن کامل

Weak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings

The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...

متن کامل

Integrated Algorithm for Decreasing Active Power Loss

Received Nov 22, 2017 Revised Jan 20, 2018 Accepted Feb 23, 2018 This paper projects an Integrated Algorithm (IA) for solving optimal reactive power problem. Quick convergence of the Cuckoo Search (CS), the vibrant root change of the Firefly Algorithm (FA), and the incessant position modernization of the Particle Swarm Optimization (PSO) has been combined to form the Integrated Algorithm (IA). ...

متن کامل

Morphological Iterative Closest Point Algorithm

This work presents a method for the registration of three-dimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it through the use of a 3-D volume containing the shapes to be registered. The Voronoi diagram of the "model" shape points is first constructed in the volume. Then this is used for the calculation of the closest point operator. This ...

متن کامل

Modified Shuffled Frog-leaping Algorithm with Dimension by Dimension Improvement

Shuffled leap frog algorithm (SFLA) is a new nature-inspired intelligent algorithm, which uses the whole update and evaluation strategy on solutions. For solving multi-dimension function optimization problems, this strategy will deteriorate the convergence speed and the quality of solution of algorithm due to interference phenomena among dimensions. To overcome this shortage, a dimension by dim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2007

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2006.06.010